Scott Aaronson - PDFSEARCH.IO - Document Search Engine

Scott Aaronson
Results: 49

#	Item
11	NP-complete Problems and Physical Reality arXiv:quant-ph/0502072v2 21 Feb 2005 Scott Aaronson∗ Add to Reading List Source URL: cqi.inf.usi.ch Language: English - Date: 2012-02-22 09:04:08 Computational complexity theory Complexity classes Quantum computing Theoretical computer science Mathematical optimization Quantum algorithm NP P versus NP problem BQP PP Low Time complexity
12	Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second, Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-01-08 10:48:49 Theory of computation Computability theory Busy beaver Computable function Computability Turing machine Halting problem Hypercomputation Computable number Algorithm Alan Turing Ackermann function
13	Recent Interactions between TCS and Quantum Physics Scott Aaronson September 2013 In 1994, when Peter Shor announced his famous algorithm for factoring integers in polynomial time using a quantum computer, it wasn’t ob Add to Reading List Source URL: thmatters.files.wordpress.com Language: English - Date: 2015-10-14 11:22:07 Quantum information science Quantum computing Quantum cryptography Quantum mechanics Emerging technologies Quantum algorithm Quantum information Quantum gravity Quantum complexity theory Theoretical computer science Boson sampling Quantum key distribution
14	A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory Adam Yedidia Scott Aaronson Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2016-05-03 08:34:47 Mathematics Theoretical computer science Computability theory Mathematical logic Theory of computation Turing machine Models of computation Busy beaver Halting problem ZermeloFraenkel set theory Computability Computable function
15	Optimal Demand-Oriented Topology for Hypertext Systems July 29, 1997 ACM SIGIR’97 Scott Aaronson <> Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2006-11-24 04:02:42
16	The Need for Structure in Quantum Speedups Scott Aaronson∗ MIT Andris Ambainis† University of Latvia and IAS, Princeton Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-02-06 14:52:01
17	Quantum Copy-Protection and Quantum Money Scott Aaronson∗ Abstract 1 Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2009-05-12 21:03:22
18	Impossibility of Succinct Quantum Proofs for Collision-Freeness Scott Aaronson∗ Abstract We show that any quantum algorithm to decide whether a function f : [n] → [n] is a Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2011-10-21 00:13:04
19	BQP and the Polynomial Hierarchy Scott Aaronson∗ Abstract The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2010-02-16 00:41:32
20	Forrelation: A Problem that Optimally Separates Quantum ∗ from Classical Computing † Scott Aaronson Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2015-04-11 11:37:21

UPDATE